Monotone Matching in Perfect and Imperfect Worlds
نویسندگان
چکیده
منابع مشابه
Monotone Coupling and the Ising Model 1. Perfect Matching
Case 1: Choose any x ∈ VI and any y ∈ ∂{x} (by hypothesis, ∂{x} has at least two elements). Let G∗ be the bipartite graph with input set V ∗ I = VI − {x}, output set V ∗ O = VO − {y}, and whose edges are the same as those of G, but with edges incident to either x or y deleted. The bipartite graph G∗ satisfies the hypothesis (1.1), because in Case 1 every proper subsetA ⊂ VI has |∂A| ≥ |A|+1, so...
متن کاملImperfect perfect lens.
We have quantitatively established a fundamental limitation on the ultimate spatial resolution of the perfect lens (thin metal slab) in the near field. This limitation stems from the spatial dispersion of the dielectric response of the Fermi liquid of electrons with Coulomb interaction in the metal. We discuss possible applications in nanoimaging, nanophotolithography, and nanospectroscopy.
متن کاملPerfect Taxation with Imperfect Competition
This paper analyzes features of perfect taxation – also known as optimal taxation – when one or more private markets is imperfectly competitive. Governments with perfect information and access to lump-sum taxes can provide corrective subsidies that render outcomes efficient in the presence of imperfect competition. Relaxing either of these two conditions removes the government’s ability to supp...
متن کاملPerfect Versus Imperfect Monitoring in Repeated Games
We show that perfect monitoring is not necessarily the optimal monitoring technology in repeated games, unless players are both patient and have access to a mediator who can condition her recommendations on the entire history of actions and recommendations. This claim follows from three results. First, players can be better o¤ with unmediated imperfect (public or private) monitoring than with m...
متن کاملPerfect simulation and non-monotone Markovian systems
Perfect simulation, or coupling from the past, is an efficient technique for sampling the steady state of monotone discrete time Markov chains. Indeed, one only needs to consider two trajectories corresponding to minimal and maximal state in the system. We show here that even for non-monotone systems one only needs to compute two trajectories: an infimum and supremum envelope. Since the sequenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Economic Studies
سال: 2002
ISSN: 0034-6527,1467-937X
DOI: 10.1111/1467-937x.00231